When is a Work-Conserving Switch Not?
نویسندگان
چکیده
Crossbar-based switches are commonly used to implement routers with throughputs up to about 1 Tb/s. The advent of work-conserving crossbar scheduling algorithms now makes it possible to engineer systems that perform well, even under extreme traffic conditions. Unfortunately, all the published work-conservation results for crossbar scheduling apply only to systems that switch fixed-length cells, not variable length packets. Routers that use a cellbased crossbar with a nominally work-conserving scheduler to switch variable length packets can fail to be work-conserving at the external links, since the router cannot forward a packet until all of its constituent cells reach the output line card. Speedups as large as the number of inputs and outputs can be required to achieve work-conservation, using schedulers that operate only on cells. There appear to be fundamental obstacles to achieving practical workconservation for variable length packet switches based on unbuffered crossbars. However, we show that adding buffers to crossbars allows work-conservation to be achieved for variable length packet switching, using modest speedups. In particular we define packet versions of the Group by Virtual Output Queue (GVOQ) scheduler of Chuang et. al. and the Least Occupied Output First (LOOFA) scheduler of Krishna et. al. and show that they are both workconserving for speedups ≥2. Specific versions of both algorithms are also shown to be orderpreserving for speedups ≥2, meaning that they can exactly emulate an ideal, output queued switch. This work is supported by the National Science Foundation (grant #CNS-0325298).
منابع مشابه
When is a Work-Conserving Switch Not?
Crossbar-based switches are commonly used to implement routers with throughputs up to about 1 Tb/s. The advent of work-conserving crossbar scheduling algorithms now makes it possible to engineer systems that perform well, even under extreme traffic conditions. Unfortunately, all the published work-conservation results for crossbar scheduling apply only to systems that switch fixed-length cells,...
متن کاملAn Efficient Matching Algorithm for a High-Throughput, Low-Latency Data Switch
This paper focuses on two desired properties of cell-based switches for digital data networks: (1) data cells should not be detained inside the switch any longer than necessary (the work-conserving property) and (2) data cells that have been in the switch longer (older cells) should have priority over younger cells (the order-conserving property). A well-known, but expensive design of a workand...
متن کاملOn the speedup required for work-conserving crossbar switches
This paper describes the architecture for a workconserving server using a combined I/O-buffered crossbar switch. The switch employs a novel algorithm based on output occupancy, the lowest occupancy output first algorithm (LOOFA), and a speedup of only two. A work-conserving switch provides the same throughput performance as an output-buffered switch. The workconserving property of the switch is...
متن کاملTwo-Queue Polling Systems with Switching Policy Based on the Queue which is Not Being Served
We study a system of two non-identical and separate M/M/1/• queues with capacities (buffers) C1 < ∞ and C2 = ∞, respectively, served by a single server that alternates between the queues. The server’s switching policy is threshold-based, and, in contrast to other threshold models, is determined by the state of the queue that is not being served. That is, when neither queue is empty while the se...
متن کاملAn efficient ATM network switch scheduling
The problem of allocating network resources to application sessions backlogged at an individual switch has a great impact on the end-to-end delay and throughput guarantees offered by the network. There exists a class of algorithms based on Weighted Fair Queueing (WFQ) for scheduling packets which are work-conserving and they guarantee fairness to the backlogged sessions. These algorithms also a...
متن کامل